A graph-based hyper-heuristic for educational timetabling problemsBURKE, Edmund K; MCCOLLUM, Barry; MEISELS, Amnon et al.European journal of operational research. 2007, Vol 176, Num 1, pp 177-192, issn 0377-2217, 16 p.Article

Fast and frugal heuristics: rationality and the limits of naturalismARLO-COSTA, Horacio; PEDERSEN, Arthur Paul.Synthese (Dordrecht). 2013, Vol 190, Num 5, pp 831-850, issn 0039-7857, 20 p.Conference Paper

An extendable heuristic framework to solve the p-compact-regions problem for urban economic modelingWENWEN LI; CHURCH, Richard L; GOODCHILD, Michael F et al.Computers, environment and urban systems. 2014, Vol 43, pp 1-13, issn 0198-9715, 13 p.Article

HSGA: a hybrid heuristic algorithm for workflow scheduling in cloud systems : Cloud Computing: Platforms and SolutionsARASH GHORBANNIA DELAVAR; ARYAN, Yalda.Cluster computing. 2014, Vol 17, Num 1, pp 129-137, issn 1386-7857, 9 p.Article

A two-stage hybrid flow shop with dedicated machines at the first stageJAEHWAN YANG.Computers & operations research. 2013, Vol 40, Num 12, pp 2836-2843, issn 0305-0548, 8 p.Article

Packing first, routing second: a heuristic for the vehicle routing and loading problemBORTFELDT, Andreas; HOMBERGER, Jörg.Computers & operations research. 2013, Vol 40, Num 3, pp 873-885, issn 0305-0548, 13 p.Article

College students' credibility judgments and heuristics concerning WikipediaLIM, Sook.Information processing & management. 2013, Vol 49, Num 2, pp 405-419, issn 0306-4573, 15 p.Article

The compatibility heuristic in non-categorical hypothetical reasoning: Inferences between conditionals and disjunctionsESPINO, Orlando; BYRNE, Ruth M. J.Cognitive psychology (Print). 2013, Vol 67, Num 3, pp 98-129, issn 0010-0285, 32 p.Article

A prototype column generation strategy for the multiple container loading problemWENBIN ZHU; WEILI HUANG; LIM, Andrew et al.European journal of operational research. 2012, Vol 223, Num 1, pp 27-39, issn 0377-2217, 13 p.Article

A variable depth search branchingCORNILLIER, Fabien; EDUARDO PECORA, Jose; CHARLES, Vincent et al.Operations research letters. 2012, Vol 40, Num 4, pp 265-271, issn 0167-6377, 7 p.Article

Assessment of the sunk-cost effect in clinical decision-makingBRAVERMAN, Jennifer A; BLUMENTHAL-BARBY, J. S.Social science & medicine (1982). 2012, Vol 75, Num 1, pp 186-192, issn 0277-9536, 7 p.Article

A heuristic approach for resource constrained project scheduling with uncertain activity durationsBRUNI, M. E; BERALDI, P; GUERRIERO, F et al.Computers & operations research. 2011, Vol 38, Num 9, pp 1305-1318, issn 0305-0548, 14 p.Article

Approximation algorithms for multicast routing in ad hoc wireless networksDEYING LI; QINGHUA ZHU.Journal of combinatorial optimization. 2011, Vol 21, Num 3, pp 293-305, issn 1382-6905, 13 p.Article

Completion time variance minimization in single machine and multi-machine systemsSRIRANGACHARYULU, B; SRINIVASAN, G.Computers & operations research. 2010, Vol 37, Num 1, pp 62-71, issn 0305-0548, 10 p.Article

Rematch: a highly reliable scheduling algorithm on heterogeneous wireless mesh networkPANLONG YANG; GUIHAI CHEN.Journal of supercomputing. 2010, Vol 51, Num 2, pp 224-240, issn 0920-8542, 17 p.Article

A new heuristic algorithm for the machine scheduling problem with job delivery coordinationSU, Chi-Shiang; PAN, Jason Chao-Hsien; HSU, Tsung-Shin et al.Theoretical computer science. 2009, Vol 410, Num 27-29, pp 2581-2591, issn 0304-3975, 11 p.Article

A route set construction algorithm for the transit network design problemMAUTTONE, Antonio; URQUHART, Maria E.Computers & operations research. 2009, Vol 36, Num 8, pp 2440-2449, issn 0305-0548, 10 p.Article

Some heuristic algorithms for total tardiness minimization in a flowshop with blockingRONCONI, Débora P; HENRIQUES, Luis R. S.Omega (Oxford). 2009, Vol 37, Num 2, pp 272-281, issn 0305-0483, 10 p.Article

Abraham Lincoln and Harry Potter: Children's differentiation between historical and fantasy charactersCORRIVEAU, Kathleen H; KIM, Angie L; SCHWALEN, Courtney E et al.Cognition. 2009, Vol 113, Num 2, pp 213-225, issn 0010-0277, 13 p.Article

A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principlesRAJA BALACHANDAR, S; KANNAN, K.Applied mathematics and computation. 2008, Vol 202, Num 1, pp 71-77, issn 0096-3003, 7 p.Article

An improved NEH-based heuristic for the permutation flowshop problemXINGYE DONG; HOUKUAN HUANG; PING CHEN et al.Computers & operations research. 2008, Vol 35, Num 12, pp 3962-3968, issn 0305-0548, 7 p.Article

Determination of replenishment dates for restricted-storage, static demand, cyclic replenishment scheduleYAO, Ming-Jong; CHU, Weng-Ming; LIN, Yen-Fei et al.Computers & operations research. 2008, Vol 35, Num 10, pp 3230-3242, issn 0305-0548, 13 p.Article

Solving the resource-constrained project scheduling problem using filter-and-fan approachRANJBAR, Mohammad.Applied mathematics and computation. 2008, Vol 201, Num 1-2, pp 313-318, issn 0096-3003, 6 p.Article

A heuristic approach to simultaneous course/student timetablingHEAD, Christopher; SHABAN, Sami.Computers & operations research. 2007, Vol 34, Num 4, pp 919-933, issn 0305-0548, 15 p.Article

An approximate decomposition algorithm for scheduling on parallel machines with heads and tailsGHARBI, Anis; HAOUARI, Mohamed.Computers & operations research. 2007, Vol 34, Num 3, pp 868-883, issn 0305-0548, 16 p.Article